A recursive construction for simple t−designs using resolution
نویسنده
چکیده
This work presents a recursive construction for simple t-designs using resolutions of the ingredient designs. The result extends a construction of t-designs in our recent paper [39]. Essentially, the method in [39] describes the blocks of a constructed design as a collection of block unions from a number of appropriate pairs of disjoint ingredient designs. Now, if some pairs of these ingredient t-designs have both a suitable s-resolution, then we can define a distance mapping on their resolution classes. Using this mapping enables us to have more possibilities for forming blocks from those pairs. The method makes it possible for constructing many new simple t-designs. We give some application results of the new construction. 2010 Mathematics Subject Classification: 05B05
منابع مشابه
Simple t-designs: a recursive construction for arbitrary t
The aim of this paper is to present a recursive construction of simple t−designs for arbitrary t. The construction is of purely combinatorial nature and it requires finding solutions for the indices of the ingredient designs that satisfy a certain set of equalities. We give a small number of examples to illustrate the construction, whereby we have found a large number of new t−designs, which we...
متن کاملA Recursive Construction for Low-Complexity Non-coherent Constellations
It is known that at high signal to noise ratio (SNR), or for large coherence interval (T ), a constellations of unitary matrices can achieve the capacity of the non-coherent multiple-antenna system in block Rayleigh flat-fading channel. For a single transmit antenna system, a unitary constellation is simply a collection of T -dimensional unit vectors. Nevertheless, except for a few special case...
متن کاملOn the existence of large sets of t-designs of prime sizes1
In this paper, we employ the known recursive construction methods to obtain some new existence results for large sets of t-designs of prime sizes. We also present a new recursive construction which leads to more comprehensive theorems on large sets of sizes two and three. As an application, we show that for infinitely many values of block size, the trivial necessary conditions for the existence...
متن کاملA new look at an old construction: Constructing (simple) 3-designs from resolvable 2-designs
In 1963, Shrikhande and Raghavarao [5] published a recursive construction for designs that starts with a resolvable design (the “master design”) and then uses a second design (“the indexing design”) to take certain unions of blocks in each parallel class of the master design. Several variations of this construction have been studied by different authors. We revisit this construction, concentrat...
متن کاملA recursive construction of a class of finite normalized tight frames
Finite normalized tight frames are interesting because they provide decompositions in applications and some physical interpretations. In this article, we give a recursive method for constructing them.
متن کامل